Implied Constraints for Automaton Constraints
نویسندگان
چکیده
Basic: linear inequalities containing only current accumulator values (i.e. ci≥0) History Variables: number of previous accumulator values (i.e. ci-2+1≥ci) State Variable: include a variable q representing the current state (i.e. ci-ci-1≤q) State Specific Implied Constraints: generate ICs that hold at specific states (i.e. q=s ⇒ ci=ci-1) Index Variable: include the current index (i.e. 2ci≤i) Example The nGroup(N, S, W) constraint holds if and only if there are N groups of values from the set W in the sequence S of variables.
منابع مشابه
Time-Series Constraints: Improvements and Application in CP and MIP Contexts
A checker for a constraint on a variable sequence can often be compactly specified by an automaton, possibly with accumulators, that consumes the sequence of values taken by the variables; such an automaton can also be used to decompose its specified constraint into a conjunction of logical constraints. The inference achieved by this decomposition in a CP solver can be boosted by automatically ...
متن کاملLinking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a constraint, we derive an implied constraint b...
متن کاملGenerating Linear Invariants for a Conjunction of Automata Constraints
We propose a systematic approach for generating linear implied constraints that link the values returned by several automata with accumulators after consuming the same input sequence. The method handles automata whose accumulators are increased by (or reset to) some non-negative integer value on each transition. We evaluate the impact of the generated linear invariants on conjunctions of two fa...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملSymmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutions, then searching for solutions that satisfy the constraints. Experts often augment models with implied constraints and constraints that break symmetries in the model. An emerging pattern in the modelling process, highl...
متن کامل